Streaming 1-Center with Outliers in High Dimensions
نویسندگان
چکیده
We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily large), enclose all but z points using a ball of minimum radius.
منابع مشابه
A Streaming Algorithm for 2-Center with Outliers in High Dimensions
We study the 2-center problem with outliers in high-dimensional data streams. Given a stream of points in arbitrary d dimensions, the goal is to find two congruent balls of minimum radius covering all but at most z points. We present a (1.8 + ε)approximation streaming algorithm, improving over the previous (4+ε)-approximation algorithm available for the problem. The space complexity and update ...
متن کاملA Streaming Algorithm for the Convex Hull
We study the 2-center problem with outliers in highdimensional data streams. Given a stream of points in arbitrary d dimensions, the goal is to find two congruent balls of minimum radius covering all but z points. We provide a (1.8 + ε)-approximation streaming algorithm for the problem, improving upon the previous (4 + ε)approximation algorithm available for the problem. The space complexity an...
متن کاملImproved MapReduce and Streaming Algorithms for k-Center Clustering (with Outliers)
We present efficient MapReduce and Streaming algorithms for the $k$-center problem with and without outliers. Our algorithms exhibit an approximation factor which is arbitrarily close to the best possible, given enough resources.
متن کاملStreaming Algorithms for k-Center Clustering with Outliers and with Anonymity
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a clustering comparable in cost to the optimal offline solution, are especially useful. We develop the first streaming algorithms achieving a constant-factor approximation to the cluster radius for two variations of the k-cent...
متن کاملA Simple Streaming Algorithm for Minimum Enclosing Balls
We analyze an extremely simple approximation algorithm for computing the minimum enclosing ball (or the 1-center) of a set of points in high dimensions. We prove that this algorithm computes a 3/2-factor approximation in any dimension using minimum space in just one pass over the data points.
متن کامل